Congruence Lattices of Congruence Semidistributive Algebras
نویسندگان
چکیده
Nearly twenty years ago, two of the authors wrote a paper on congruence lattices of semilattices [9]. The problem of finding a really useful characterization of congruence lattices of finite semilattices seemed too hard for us, so we went on to other things. Thus when Steve Seif asked one of us at the October 1990 meeting of the AMS in Amherst what we had learned in the meantime, the answer was nothing. But Seif’s question prompted us to return to the subject, and we soon found that we had missed at least one nice property: the congruence lattice of a finite semilattice is an upper bounded homomorphic image of a free lattice. This strengthens the wellknown fact that congruence lattices of semilattices satisfy the meet semidistributive law SD∧. It turns out that this result admits a striking generalization: if V is a variety of algebras whose congruence lattices are meet semidistributive, then the congruence lattices of finite algebras in V are upper bounded homomorphic images of a free lattice. The proof of this theorem takes us into the realm of tame congruence theory, and with modest additional effort we are able to find strong restrictions on the structure of the lattice Lv(W) of subvarieties of an arbitrary locally finite variety W. Stimulated by Viktor Gorbunov’s talk at the Jónsson Symposium in Iceland in July 1990, and the corresponding draft of [12] which he provided us, we went on to ask if this type of result might apply to lattices of quasivarieties. It is known that the lattice Lq(K) of all quasivarieties contained in a quasivariety K satisfies SD∨ [11], and the improved (finite) version states that if K is a locally finite quasivariety of finite type and Lq(K) is finite, then it is a lower bounded homomorphic image of a free lattice. There are natural generalizations of this theorem for varieties which are not locally finite. Perhaps an analogy with the modular and Arguesian laws provides a good way to interpret these results. Dedekind devised the modular law to capture the permutability of normal subgroup lattices, but the Arguesian law is now recognized to be a more accurate reflection of this property. Similarly, congruence lattices of
منابع مشابه
Congruence Lifting of Diagrams of Finite Boolean Semilattices Requires Large Congruence Varieties
We construct a diagram D⊲⊳, indexed by a finite partially ordered set, of finite Boolean 〈∨, 0, 1〉-semilattices and 〈∨, 0, 1〉-embeddings, with top semilattice 2, such that for any variety V of algebras, if D⊲⊳ has a lifting, with respect to the congruence lattice functor, by algebras and homomorphisms in V, then there exists an algebra U in V such that the congruence lattice of U contains, as a...
متن کاملA Scheme for Congruence Semidistributivity
A diagrammatic statement is developed for the generalized semidistributive law in case of single algebras assuming that their congruences are permutable. Without permutable congruences, a diagrammatic statement is developed for the ∧-semidistributive law.
متن کاملThe Shape of Congruence Lattices
We develop the theories of the strong commutator, the rectangular commutator, the strong rectangular commutator, as well as a solvability theory for the nonmodular TC commutator. These theories are used to show that each of the following sets of statements are equivalent for a variety V of algebras. (I) (a) V satisfies a nontrivial congruence identity. (b) V satisfies an idempotent Maltsev cond...
متن کاملA Finite Basis Theorem for Residually Finite, Congruence Meet-Semidistributive Varieties
We derive a Mal'cev condition for congruence meet-semidistributivity and then use it to prove two theorems. Theorem A: if a variety in a nite language is congruence meet-semidistributive and residually less than some nite cardinal, then it is nitely based. Theorem B: there is an algorithm which, given m < ! and a nite algebra in a nite language, determines whether the variety generated by the a...
متن کاملFrom Join-irreducibles to Dimension Theory for Lattices with Chain Conditions
For a finite lattice L, the congruence lattice ConL of L can be easily computed from the partially ordered set J(L) of join-irreducible elements of L and the join-dependency relation DL on J(L). We establish a similar version of this result for the dimension monoid DimL of L, a natural precursor of ConL. For L join-semidistributive, this result takes the following form: Theorem 1. Let L be a fi...
متن کامل